Fast randomized parallel methods for planar convex hull construction
نویسندگان
چکیده
منابع مشابه
Fast Randomized Parallel Methods for Planar Convex Hull Construction
We present a number of eecient parallel algorithms for constructing 2-dimensional convex hulls on a randomized CRCW PRAM. Speciically, we show how to build the convex hull of n pre-sorted points in the plane in O(1) time using O(n log n) work, with n-exponential probability, or, alternately, in O(log n) time using O(n) work, with n-exponential probability. We also show how to nd the convex hull...
متن کاملRandomized Parallel 3D Convex Hull Algorithm
This paper presents a randomize, coarse-grained, parallel algorithm which computes the 3-dimensional convex hull of a set of points with high probability in O(n log n p) time, where n is the number of points, and p is the number of processors. Furthermore, O(1) communication steps are used, with O(n=p) data sent at each step, by each processor. The material presented in this paper summarizes th...
متن کاملDynamic Planar Convex Hull
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(logn) time per operation. The space usage of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangen...
متن کاملAdaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearranging) problems of arrays, and define the “presortedness” as a distance from the input array to t...
متن کاملCudaHull: Fast parallel 3D convex hull on the GPU
In this paper, we present a novel parallel algorithm for computing the convex hull of a set of points in 3D using the CUDA programming model. It is based on the QuickHull approach and starts by constructing an initial tetrahedron using four extreme points, discards the internal points, and distributes the external points to the four faces. It then proceeds iteratively. In each iteration, it ref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1997
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00036-4